Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs
نویسندگان
چکیده
A variety of relationships between graph parameters involving packings, perfect neighbourhood, irredundant and R-annihilated sets is obtained. Some of the inequalities are improvements of existing bounds for the lower irredundance number, and others are motivated by the conjecture (recently disproved) that for any graph the smallest cardinality of a perfect neighbourhood set is at most the lower irredundance number.
منابع مشابه
An inequality chain of domination parameters for trees
We prove that the smallest cardinality of a maximal packing in any tree is at most the cardinality of an R-annihilated set. As a corollary to this result we point out that a set of parameters of trees involving packing, perfect neighbourhood, R-annihilated, irredundant and dominating sets is totally ordered. The class of trees for which all these parameters are equal is described and we give an...
متن کاملTotal perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملFrom Irredundance to Annihilation: a Brief Overview of Some Domination Parameters of Graphs
During the last thirty years, the concept of domination in graphs has generated an impressive interest. A recent bibliography on the subject contains more than 1200 references and the number of new definitions is continually increasing. Rather than trying to give a catalogue of all of them, we survey the most classical and important notions (as independent domination, irredundant domination, k-...
متن کاملIrredundancy in Circular Arc Graphs
Golumbic, M.C. and R.C. Laskar, Irredundancy in circular arc graphs, Discrete Applied Mathematics 44 (1993) 79-89. A set ofvertices Xis called irredundant if for every x in Xthe closed neighborhood N[x] contains a vertex which is not a member of N[X-x], the union of the closed neighborhoods of the other vertices. In this paper we show that for circular arc graphs the size of the maximum irredun...
متن کاملOn Bin Packing with Conflicts
We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . . , sn ∈ [0, 1] and a conflict graph G = (V, E), the goal is to find a partition of the items into independent sets of G, where the total size of each independent set is at most one, so that the number of independent sets in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 18 شماره
صفحات -
تاریخ انتشار 1998